The restrained rainbow bondage number of a graph
نویسندگان
چکیده
منابع مشابه
The k-rainbow bondage number of a graph
Let D = (V,A) be a finite and simple digraph. A k-rainbow dominating function (kRDF) of a digraph D is a function f from the vertex set V to the set of all subsets of the set {1, 2, . . . , k} such that for any vertex v ∈ V with f(v) = ∅ the condition ⋃ u∈N(v) f(u) = {1, 2, . . . , k} is fulfilled, where N(v) is the set of in-neighbors of v. The weight of a kRDF f is the value ω(f) = ∑ v∈V |f(v...
متن کاملBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
متن کاملThe bondage number of a graph
The bondage number b(G) of a non empty graph G is the minimum number of edger whose removal from G results in a graph having domination number greater than the domination number of G. In this paper we characterize graphs for which b(G) = p − 1 and b(G) = (γ − 1)+̇1. We also introduce the concept of uniform bondage number bu(G) and determine the exact value of bu(G) for several classes of graphs....
متن کاملBondage and Non-bondage Number of a Fuzzy Graph
In this paper, bondage and non-bondage set of a fuzzy graph are discussed. The bondage number b(G) and non-bondage number bn(G) of a fuzzy graph G are defined. The upper bound for both b(G) and bn(G) are given. Also some results on b(G) and bn(G) are discussed. The exact values of b(G) and bn(G) are determined for several classes of fuzzy graphs. AMS Subject Classification: 03E72, 05C40, 05C72
متن کامل2−bondage Number of a Fuzzy Graph
In this paper, 2−bondage set of a fuzzy graph G is defined. The 2−bondage number, b2(G) is the minimum cardinality among all 2−bondage sets of G. The condition for a 2−bondage set of a fuzzy graph to be a bondage set is also given. The exact values of b2(G) is determined for several classes of fuzzy graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tamkang Journal of Mathematics
سال: 2018
ISSN: 2073-9826,0049-2930
DOI: 10.5556/j.tkjm.49.2018.2365